#include<bits/stdc++.h>
using namespace std;
int a[100005],h[100005];
int n,num,l;
int fd(int x){
    if(x>n)return x;
    if(h[x]==0){
        h[x]=x+1;
        num--;
        return h[x];
    }
    return h[x]=fd(h[x]);
}
int main()
{
    freopen("duel.in","r",stdin);
    freopen("duel.out","w",stdout);
    scanf("%d",&n);
    num=n;
    for(int i=1;i<=n;++i)scanf("%d",&a[i]);
    sort(a+1,a+1+n);
    for(int i=1;i<=n;++i){
        l=upper_bound(a+1,a+1+n,a[i])-a;
        fd(l);
    }
    printf("%d",num);
    return 0;
}
